Mitigating errors by quantum verification and postselection

نویسندگان

چکیده

Correcting errors due to noise in quantum circuits run on current and near-term hardware is essential for any convincing demonstration of advantage. Indeed, many cases it has been shown that renders efficiently classically simulable, thereby destroying advantage potentially offered by an ideal (noiseless) implementation these circuits. Although the technique error correction (QEC) allows correcting very accurately, QEC usually requires a large overhead physical qubits which not reachable with currently available hardware. This motivation behind field mitigation, aims at developing techniques correct important part circuits, while also being compatible In this work, we present mitigation based from verification, so-called accreditation protocol, together postselection. Our expectation value observable $O$, output multiple runs noisy where level preparations, gates, measurements. We discuss sample complexity our procedure provide rigorous guarantees mitigated under some realistic assumptions noise. tailored time-dependent behaviors, as allow states be different between protocol. validate findings running

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Postselection Finite Quantum Automata

Postselection for quantum computing devices was introduced by S.Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson’s type postselection in quantum finite automata. There are several nonequivalent definitions of qua...

متن کامل

Probabilistic and quantum finite automata with postselection

We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L¯ ace et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the ...

متن کامل

Rational approximations and quantum algorithms with postselection

We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using postselection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We give optimal (up to constant factors) quantum algorithms with postselection for the Majority functio...

متن کامل

Quantum Computing, Postselection, and Probabilistic Polynomial-Time

I study the class of problems efficiently solvable by a quantum computer, given the ability to ‘postselect’ on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or probabilistic polynomial-time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. T...

متن کامل

Postselection technique for quantum channels with applications to quantum cryptography.

We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for an arbitrary input, it is sufficient to consider the case where the input is a particular de Finetti-type state, i.e., a state which consists of n identi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2022

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physreva.105.052608